LOW POWER CONSUMPTION ALGORITHM ADOPTING CONSTANT MULTIPLICATIONS
نویسندگان
چکیده
منابع مشابه
A New algorithm for multiple constant multiplications with low power consumption
Multiplications are costly operations in FIR filters. But for any given filter, the filter weights are constants. Several techniques have been developed over the years for the efficient realization of constant multiplications by a network of add/subtract-shift operations [6]. Constant multiplication methods are broadly of two types, (i) single constant multiplication (SCM) methods and (ii) mult...
متن کاملAn Efficient Realization Area-Time with Multi Constant Multiplications for Low Power Design
In this paper, critical path of multiple constant multiplication (MCM) block is analysed precisely and optimized for high-speed and low-complexity implementation. A delay model based on signal propagation path is proposed for more precise estimation of critical path delay of MCM blocks than the conventional adder depth and the number of cascaded full adders. A dual objective configuration optim...
متن کاملA Low Power Consumption Algorithm for Efficient Energy Consumption in ZigBee Motes
Wireless Sensor Networks (WSNs) are becoming increasingly popular since they can gather information from different locations without wires. This advantage is exploited in applications such as robotic systems, telecare, domotic or smart cities, among others. To gain independence from the electricity grid, WSNs devices are equipped with batteries, therefore their operational time is determined by...
متن کاملMaximal Sharing of Partial Terms in Multiple Constant Multiplications: Analysis of an Exact Algorithm
In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean network that covers all possible partial terms which may be used to generate the set of coefficients in the MCM instance. The PIs to this network are shifted versions of the MCM input. An AND gate represents an adder or ...
متن کاملOptimal Common Sub-Expression Elimination Algorithm of Multiple Constant Multiplications with a Logic Depth Constraint
In the context of multiple constant multiplication (MCM) design, we propose a novel common sub-expression elimination (CSE) algorithm that models the optimal synthesis of coefficients into a 0-1 mixedinteger linear programming (MILP) problem with a user-defined generic logic depth constraint. We also propose an efficient solution space, which combines all minimal signed digit (MSD) representati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INTERNATIONAL JOURNAL OF ELECTRONICS & COMMUNICATION ENGINEERING & TECHNOLOGY
سال: 2019
ISSN: 0976-6472,0976-6464
DOI: 10.34218/ijecet.10.2.2019.002